On Small Depth Threshold Circuits
نویسنده
چکیده
In this talk we will consider various classes defined by small depth polynomial size circuits which contain threshold gates and parity gates. We will describe various inclusions between many classes defined in this way and also classes whose definitions rely upon spectral properties of Boolean functions.
منابع مشابه
More on Computing Boolean Functions by Sparse Real Polynomials and Related Types of Threshold Circuits
In this paper we investigate the computational power of threshold{ AND circuits versus threshold{XOR circuits. Starting from the observation that small weight threshold{AND circuits can be simulated by small weight threshold{XOR circuits we pose the question whether a Supported by the grant A1019602 of the Academy of Sciences of the Czech Republic. A major part of the results were obtained whil...
متن کاملOn the Power of Small - Depththreshold
We investigate the power of threshold circuits of small depth. In particular, we give functions that require exponential size unweighted threshold circuits of depth 3 when we restrict the bottom fanin. We also prove that there are monotone functions f k that can be computed in depth k and linear size ^; _-circuits but require exponential size to compute by a depth k ? 1 monotone weighted thresh...
متن کاملThreshold Circuits of Small Majority-Depth
Constant-depth polynomial-size threshold circuits are usually classi ed according to their total depth. For example, the best known threshold circuits for iterated multiplication and division have depth four and three, respectively. In this paper, the complexity of threshold circuits is investigated from a di erent point of view: explicit AND, OR gates are allowed in the circuits, and a thresho...
متن کاملAverage-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
We show average-case lower bounds for explicit Boolean functions against bounded-depth thresh-old circuits with a superlinear number of wires. We show that for each integer d > 1, there isεd > 0 such that Parity has correlation at most 1/nΩ(1) with depth-d threshold circuits whichhave at most n1+εd wires, and the Generalized Andreev Function has correlation at most 1/2nwith ...
متن کاملComputing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates
We consider depth-3 unbounded fanin threshold circuits. Gates are usual threshold functions T n k which compute 1 ii at least k of the inputs are equal to 1; the minimum minfk; n ? k + 1g is the threshold value of this gate. We show that the function T n k cannot be computed by a small depth-3 threshold circuit with threshold values of its gates much smaller than k:
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992